A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems
نویسندگان
چکیده
We present a decentralized heuristic applicable to multi-agent systems (MAS), which is able to solve multiple-choice combinatorial optimization problems (MC-COP). First, the MC-COP problem class is introduced and subsequently a mapping to MAS is shown, in which each class of elements in MC-COP corresponds to a single agent in MAS. The proposed heuristic ”COHDA” is described in detail, including evaluation results from the domain of decentralized energy management systems.
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملDecentralized Task Assignment for Multiple UAVs using Genetic Algorithm with Negotiation scheme approach
This paper deals with a task assignment problem of cooperative multiple Unmanned Aerial Vehicles (UAVs). The problem about assigning the tasks to each UAV can be interpreted as a combinatorial optimization problem such as Travelling Salesman Problem (TSP), Vehicle Routing Problem (VRP), and Generalized Assignment Problem (GAP). These problems have NP-complete computational complexity which has ...
متن کاملEvaluation of a Self-organizing Heuristic for Interdependent Distributed Search Spaces
Whenever multiple stakeholders try to optimize a common objective function in a distributed way, an adroit coordination mechanism is necessary. This contribution presents a formal model of distributed combinatorial optimization problems. Subsequently, a heuristic is introduced, that uses self-organizing mechanisms to optimize a common global objective as well as individual local objectives in a...
متن کاملA hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem
We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...
متن کاملCOHDA: A Combinatorial Optimization Heuristic for Distributed Agents
Solving Distributed Constraint Optimization Problems has a large significance in today’s interconnected world. Complete as well as approximate algorithms have been discussed in the relevant literature. However, these are unfeasible if high-arity constraints are present (i. e., a fully connected constraint graph). This is the case in distributed combinatorial problems, for example in the provisi...
متن کامل